Graph Wedgelets: Adaptive Data Compression on Graphs Based on Binary Wedge Partitioning Trees and Geometric Wavelets

Binary Space Partitioning and Sparse Geometric Wavelets Representation for Image Compression

For low bit-rate compression applications, segmentation-based coding methods provide, in general, high compression ratios when compared with traditional (e.g., transform and subband) coding approaches. In this paper, we present a segmentation based image coding method that divides the desired image using binary space partitioning (BSP). Geometric wavelet is a recent development in the field of ...

Efficient Adaptive Data Compression Using Fano Binary Search Trees

In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can ...

Wavelets on Graphs via Spectral Graph Theory

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian L. Given a wavelet generating kernel g and a scale parameter t, we define the scaled wavelet operator T...

Test data compression based on geometric shapes

The increasing complexity of systems-on-a-chip with the accompanied increase in their test data size has made the need for test data reduction imperative. In this paper, we introduce a novel and efficient testindependent compression technique based on geometric shapes. The technique exploits reordering of test vectors to minimize the number of shapes needed to encode the test data. The test set...

A Tutorial on Binary Space Partitioning Trees